The Mann et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential
نویسندگان
چکیده
Manne et al. [11] designed the first algorithm computing a maximal matching that is a 23 -approximation of the maximum matching in 2 moves. However, the complexity tightness was not proved. In this paper, we exhibit a sub-exponential execution of this matching algorithm : this algorithm can stabilize after at most Ω(2 √ ) moves under the central daemon.
منابع مشابه
Polynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching
We present the first polynomial self-stabilizing algorithm for finding a 2 3 -approximation of a maximum matching in a general graph. The previous best known algorithm has been presented by Manne et al. [6] and has a sub-exponential time complexity under the distributed adversarial daemon [1]. Our new algorithm is an adaptation of the Manne et al. algorithm and works under the same daemon, but ...
متن کاملPolynomial Self-Stabilizing Maximum Matching Algorithm with Approximation Ratio 2/3
We present the first polynomial self-stabilizing algorithm for finding a 3 -approximation of a maximum matching in a general graph. The previous best known algorithm has been presented by Manne et al. [16] and has a sub-exponential time complexity under the distributed adversarial daemon [3]. Our new algorithm is an adaptation of the Manne et al. algorithm and works under the same daemon, but w...
متن کاملAn Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks
We propose a new self-stabilizing 1-maximal matching algorithm which is silent and works for any anonymous networks without a cycle of length of a multiple of 3 under a central unfair daemon. The 1-maximal matching is a 2 3 -approximation to the maximum matching, and expected to get more matching pairs than a maximal matching, which only guarantees a 1 2 -approximation. The time complexity of t...
متن کاملA Self-stabilizing -Approximation Algorithm for the Maximum Matching Problem
The matching problem asks for a large set of disjoint edges in a graph. It is a problem that has received considerable attention in both the sequential and self-stabilizing literature. Previous work has resulted in self-stabilizing algorithms for computing a maximal ( 2 -approximation) matching in a general graph, as well as computing a 3 -approximation on more specific graph types. In the foll...
متن کاملTime- and space-efficient self-stabilizing algorithms
In a distributed system error handling is inherently more difficult than in conventional systems that have a central control unit. To recover from an erroneous state the nodes have to cooperate and coordinate their actions based on local information only. Self-stabilization is a general approach to make a distributed system tolerate arbitrary transient faults by design. A self-stabilizing algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1604.08066 شماره
صفحات -
تاریخ انتشار 2016